package tree.heap;

import java.util.PriorityQueue;

public class PriorityQueueTest {

    public static void main(String[] args) {
        PriorityQueue<Integer> queue = new PriorityQueue<>();

        queue.add(3);
        queue.add(1);
        queue.add(2);

        while (!queue.isEmpty()){
            System.out.println(queue.poll());
        }
    }
}
